Перевод: со всех языков на все языки

со всех языков на все языки

Lagrange's method of multipliers

См. также в других словарях:

  • Lagrange multiplier — Figure 1: Find x and y to maximize f(x,y) subject to a constraint (shown in red) g(x,y) = c …   Wikipedia

  • Lagrange multipliers — In mathematical optimization problems, the method of Lagrange multipliers, named after Joseph Louis Lagrange, is a method for finding the extrema of a function of several variables subject to one or more constraints; it is the basic tool in… …   Wikipedia

  • Lagrange multipliers on Banach spaces — In the field of calculus of variations in mathematics, the method of Lagrange multipliers on Banach spaces can be used to solve certain infinite dimensional constrained optimization problems. The method is a generalization of the classical method …   Wikipedia

  • Constrained optimization and Lagrange multipliers — This tutorial presents an introduction to optimization problems that involve finding a maximum or a minimum value of an objective function f(x 1,x 2,ldots, x n) subject to a constraint of the form g(x 1,x 2,ldots, x n)=k.Maximum and… …   Wikipedia

  • Joseph Louis Lagrange — Lagrange redirects here. For other uses, see Lagrange (disambiguation). Joseph Louis Lagrange Joseph Louis (Giuseppe Lodovico), comte de Lagrange …   Wikipedia

  • Gauss pseudospectral method — The Gauss Pseudospectral Method (abbreviated GPM ) is a direct transcription method for discretizing a continuous optimal control problem into a nonlinear program (NLP). The Gauss pseudospectral method differs from several other pseudospectral… …   Wikipedia

  • Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… …   Wikipedia

  • Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

  • Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… …   Wikipedia

  • Hugh Everett III — Infobox Scientist name = Hugh Everett III caption = Hugh Everett in 1964 birth date = birth date|1930|11|11|mf=y birth place = Maryland, U.S. death date = death date and age|1982|7|19|1930|11|11|mf=y death place = McLean, Virginia, U.S. residence …   Wikipedia

  • Lagrangian relaxation — In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. A solution to the relaxed problem is an approximate solution to the… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»